On 2-Factors Splitting an Embedded Graph into Two Plane Graphs
نویسندگان
چکیده
We investigate 2-planarizing 2-factors, i.e. 2-factors of embedded graphs so that cutting along the cycles 2-factor we get two plane where are a spanning set face boundaries in each graphs. will give necessary criteria for an abstract graph to have embedding with as well such 2-factor. Along way, discuss which degree classical results from planar hamiltonicity theory can be extended our framework. In addition present computational on how common small cubic
منابع مشابه
An Inductive Construction for Plane Laman Graphs via Vertex Splitting
We prove that all planar Laman graphs (i.e. minimally generically rigid graphs with a non-crossing planar embedding) can be generated from a single edge by a sequence of vertex splits. It has been shown recently [6,12] that a graph has a pointed pseudo-triangular embedding if and only if it is a planar Laman graph. Due to this connection, our result gives a new tool for attacking problems in th...
متن کاملEmbedding Graphs into Embedded Graphs
A drawing of a graph G in the plane is weakly simple if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph G in the plane is weakly simple, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class. In other words, we show that c-planarity with pipes is tractab...
متن کاملSplitting an Expander Graph
Let G V E be an r regular expander graph Certain algorithms for nding edge disjoint paths require the edges of G to be partitioned into E E E Ek so that the graphs Gi V Ei are each expanders In this paper we give a non constructive proof of a very good split plus an algorithm which improves on that given in Broder Frieze and Upfal Existence and construction of edge disjoint paths on expander gr...
متن کاملan investigation on influencing factors on tourists shopping attitude of iranian handmade carpet in isfahan
چکیده ندارد.
15 صفحه اولCounting Plane Graphs: Cross-Graph Charging Schemes
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of triangulations that are embedded over a fixed set of points in the plane. We show how this method can be generalized to obtain results for various other types of graphs t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2022
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-022-02473-3